1269A - Equation - CodeForces Solution

brute force math *800

Please click on ads to support us..

Python Code: 

def is_prime(n):
    for i in range(2, int(n / 2)):
        if (n % i) == 0:
            return False
    return True


n = int(input())
i = 4
while True:
    if not is_prime(i) and not is_prime(i+n):
        print(i+n, i)
        break
    i += 1

C++ Code: 

#include <bits/stdc++.h>

using namespace std;

#define pb push_back

typedef long long int ll;

int main()
{
    //freopen("in.txt", "r", stdin);

    ll n; cin >> n;
    ll m = n; n*=8;
    cout << n+m << " " << n << endl;
    return 0;
}


Comments

Submit
0 Comments
More Questions

746A - Compote
318A - Even Odds
550B - Preparing Olympiad
939B - Hamster Farm
732A - Buy a Shovel
1220C - Substring Game in the Lesson
452A - Eevee
1647B - Madoka and the Elegant Gift
1408A - Circle Coloring
766B - Mahmoud and a Triangle
1618C - Paint the Array
469A - I Wanna Be the Guy
1294A - Collecting Coins
1227A - Math Problem
349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity